Experiments in Theorem Proving and Model Checking for Protocol Verification

نویسندگان

  • Klaus Havelund
  • Natarajan Shankar
چکیده

Communication protocols pose interesting and diicult challenges for veriication technologies. The state spaces of interesting protocols are either innnite or too large for nite-state veriication techniques like model checking and state exploration. Theorem proving is also not eeective since the formal correctness proofs of these protocols can be long and complicated. We describe a series of protocol veriication experiments culminating in a methodology where theorem proving is used to abstract out the sources of unboundedness in the protocol to yield a skeletal protocol that can be veriied using model checking. Our experiments focus on the Philips bounded retransmission protocol originally studied by Groote and van de Pol and by Helmink, Sellink, and Vaandrager. First, a scaled-down version of the protocol is analyzed using the Mur state exploration tool as a debugging aid and then translated into the PVS speciication language. The PVS veriication of the generalized protocol illustrates the diiculty of using theorem proving to verify innnite-state protocols. Some of this diiculty can be overcome by extracting a nite-state abstraction of the protocol that preserves the property of interest while being amenable to model checking. We compare the performance of Mur, SMV, and the PVS model checkers on this reduced protocol. ? Sam Owre (SRI) has assisted with the use of PVS and suggested several improvements to the paper. Sreeranga Rajan (SRI) was instrumental in integrating the mu-calculus model checker (built by Geert Janssen of Eindhoven University of Technology) into PVS. SeungJoon Park of Stanford University implemented the Mur-to-PVS translator. David Cyrluk (SRI and Stanford University) sped up parts of the PVS equality decision procedure. Ken McMillan (Cadence Labs) suggested that we examine forward reachability as a way of obtaining eeciency from the PVS model checker. We are also grateful to John Rushby (SRI) for facilitating Klaus Havelund's visit to SRI, and to Therese Hardin (LITP) for providing a stimulating environment at LITP in Paris. ?? Supported by a European Community HCM grant, with origin institution being

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving

In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...

متن کامل

Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation

We present an approach to verification that combines the strengths of model-checking and theorem proving. We use theorem proving to show a bisimulation up to stuttering on a—potentially infinite-state—system. Our characterization of stuttering bisimulation allows us to do such proofs by reasoning only about single steps of the system. We present an on-the-fly method that extracts the reachable ...

متن کامل

Model checking the AMBA protocol in HOL

The Advanced Microcontroller Bus Architecture (AMBA) is an open Systemon-Chip bus protocol for high-performance buses on low-power devices. In this report we implement a simple model of AMBA and use model checking and theorem proving to verify latency, arbitration, coherence and deadlock freedom properties of the implementation. Typical microprocessor and memory verifications assume direct conn...

متن کامل

Verification of AMBA Using a Combination of Model Checking and Theorem Proving

The Advanced Microcontroller Bus Architecture (AMBA) is an open System-onChip bus protocol for high-performance buses on low-power devices. We demonstrate the combined use of model checking and theorem proving to verify both control and datapath properties in a seamless manner.

متن کامل

From Refutation to Verification

Model checking has won some industrial acceptance in debugging designs. Theorem proving and formal verification are less popular. An approach built around automated abstractions could integrate theorem proving with model checking in an acceptable way and provide a bridge between refutation and verification.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996